Computational problem - PDFSEARCH.IO - Document Search Engine

Computational problem
Results: 1172

#	Item
121	Peeling the Grid Sariel Har-Peled∗ Bernard Lidick´ y† Add to Reading List Source URL: orion.math.iastate.edu Language: English - Date: 2014-08-22 14:44:47 Convex geometry Convex analysis Euclidean plane geometry Computational geometry Polygons Convex hull Convex function Convex set Convex polygon Minkowski addition Happy ending problem
122	Metric Clustering via Consistent Labeling Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2010-09-28 14:30:42 Combinatorial optimization Operations research NP-complete problems Approximation algorithms Computational problems Linear programming Minimum k-cut Optimization problem Ear decomposition Decomposition method
123	AI System Solves SAT Geometry Questions At Same Level As Average Human Test Taker Breakthrough Achieved by Allen Institute for Artificial Intelligence and University of Washington Seattle, WA (Sept. 21, The Allen Add to Reading List Source URL: ai2-website.s3.amazonaws.com Language: English - Date: 2016-05-13 13:25:44 Allen Institute for Artificial Intelligence Artificial intelligence Philosophy of artificial intelligence Computational neuroscience Paul Allen SAT Turing test Problem solving Computer science Geometry Oren Etzioni ACT
124	CS261: A Second Course in Algorithms Lecture #19: Beating Brute-Force Search∗ Tim Roughgarden† March 8, 2016 A popular myth is that, for N P -hard problems, there are no algorithms with worst-case running time better Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2016-03-15 10:47:56 NP-complete problems Computational complexity theory Analysis of algorithms Operations research NP-hard problems Vertex cover Travelling salesman problem Dynamic programming Parameterized complexity Independent set Algorithm 2-satisfiability
125	On the Tree Search Problem with Non-uniform costs Ferdinando Cicalese, Bal´azs Keszegh, Bernard Lidick´y, D¨om¨ ot¨ or P´alv¨ Add to Reading List Source URL: orion.math.iastate.edu Language: English - Date: 2014-08-22 14:45:38 NP Search problem Functions and mappings Computational problem
126	Maximal Strip Recovery Problem with Gaps: Hardness and Approximation AlgorithmsI Laurent Bulteau, Guillaume Fertin, Irena Rusu Laboratoire d’Informatique de Nantes-Atlantique (LINA), UMR CNRS 6241 Université de Nantes Add to Reading List Source URL: pagesperso.lina.univ-nantes.fr Language: English - Date: 2013-01-07 10:28:20 Computational problems NP-complete problems Optimization problem Synteny Independent set
127	50 LINEAR PROGRAMMING Martin Dyer, Bernd G¨artner, Nimrod Megiddo and Emo Welzl Add to Reading List Source URL: people.inf.ethz.ch Language: English - Date: 2016-07-12 11:32:46 Operations research Linear programming Convex optimization Combinatorial optimization Computational geometry Bounding sphere LP-type problem Simplex algorithm Time complexity Mathematical optimization Integer programming Duality
128	Computational Complexity of Ant Colony Optimization and Its Hybridization Frank Neumann1 , Dirk Sudholt2⋆ , and Carsten Witt3⋆ 1 Max-Planck-Institut f¨ Add to Reading List Source URL: ls2-www.cs.tu-dortmund.de Language: English - Date: 2009-04-06 09:15:22 Cybernetics Operations research Mathematical optimization Ant colony optimization algorithms Search algorithms Genetic algorithm Travelling salesman problem Evolutionary algorithm Algorithm Big O notation
129	What makes the Arc-Preserving Subsequence problem hard?⋆ Guillaume Blin1 , Guillaume Fertin1 , Romeo Rizzi2 , and St´ephane Vialette3 1 2 Add to Reading List Source URL: pagesperso.lina.univ-nantes.fr Language: English - Date: 2009-07-03 08:56:55 Complexity classes NP-hardness NP P versus NP problem Computational complexity theory P Reduction
130	NP-complete Problems and Physical Reality arXiv:quant-ph/0502072v2 21 Feb 2005 Scott Aaronson∗ Add to Reading List Source URL: cqi.inf.usi.ch Language: English - Date: 2012-02-22 09:04:08 Computational complexity theory Complexity classes Quantum computing Theoretical computer science Mathematical optimization Quantum algorithm NP P versus NP problem BQP PP Low Time complexity

UPDATE